Arith . POLYNOMIAL EXTENSION OF FLECK ’ S CONGRUENCE
نویسنده
چکیده
Let p be a prime, and let f (x) be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the p-adic order of the sum k≡r (mod p β) n k (−1) k f k − r p α , where α β 0, n p α−1 and r ∈ Z. This polynomial extension of Fleck's congruence has various backgrounds and several consequences such as k≡r (mod p α) n k a k ≡ 0 mod p n−p α−1 ϕ(p α) provided that α > 1 and a ≡ −1 (mod p).
منابع مشابه
Polynomial Extension of Fleck ’ S Congruence 3
Let p be a prime, and let f (x) be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the p-adic order of the sum k≡r (mod p β) n k (−1) k f k − r p α , where α β 0, n p α−1 and r ∈ Z. This polynomial extension of Fleck's congruence has various backgrounds and several consequences such as k≡r (mod p α) n k a k ≡ 0 mod p n−p α−1 ϕ(p α) provided that ...
متن کاملArith . COMBINATORIAL CONGRUENCES AND STIRLING NUMBERS
In this paper we obtain some sophisticated combinatorial con-gruences involving binomial coefficients and confirm two conjectures of the author and Davis. They are closely related to our investigation of the pe-riodicity of the sequence P l j=0ì j ´ S(j, m)a l−j (l = m, m + 1,. . .) modulo a prime p, where a and m > 0 are integers, and those S(j, m) are Stirling numbers of the second kind. We a...
متن کاملArith . , in press . ON q - EULER NUMBERS , q - SALIÉ NUMBERS AND q -
for any nonnegative integers n, s, t with 2 ∤ t, where [k]q = (1−q)/(1−q); this is a q-analogue of Stern’s congruence E2n+2s ≡ E2n +2 (mod 2s+1). We also prove that (−q; q)n = ∏ 0<k6n(1 + q ) divides S2n(q) and the numerate of C2n(q); this extends Carlitz’s result that 2 divides the Salié number S2n and the numerate of the Carlitz number C2n. Our result on q-Salié numbers implies a conjecture o...
متن کاملPolynomial Extension of Fleck’s Congruence
Let p be a prime, and let f(x) be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the p-adic order of the sum ∑ k≡r (mod pβ) (n k ) (−1)f (⌊ k − r pα ⌋) , where α > β > 0, n > pα−1 and r ∈ Z. This polynomial extension of Fleck’s congruence has various backgrounds and several consequences such as ∑ k≡r (mod pα) (n k ) a ≡ 0 ( mod p ⌊ n−pα−1 φ(pα) ...
متن کاملPolynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher
We present an algorithm for the inference of some Multiple Context-Free Grammars from Membership and Equivalence Queries, using the Minimally Adequate Teacher model of Angluin. This is an extension of the congruence based methods for learning some Context-Free Grammars proposed by Clark (ICGI 2010). We define the natural extension of the syntactic congruence to tuples of strings, and demonstrat...
متن کامل